An exponential bound on the number of non-isotopic commutative semifields
نویسندگان
چکیده
We show that the number of non-isotopic commutative semifields odd order p n p^{n} is exponential in alttext="n"> encoding="application/x-tex">n when alttext="n equals 4 t"> = 4 t encoding="application/x-tex">n = 4t and alttext="t"> encoding="application/x-tex">t not a power alttext="2"> 2 encoding="application/x-tex">2 . introduce new family method for proving isotopy results on we use to deduce aforementioned bound. The previous best bound was quadratic given by Zhou Pott [Adv. Math. 234 (2013), pp. 43–60]. Similar bounds case even were Kantor [J. Algebra 270 (2003), 96–114] Williams [Trans. Amer. Soc. 356 (2004), 895–938].
منابع مشابه
New commutative semifields
We introduce infinite families of perfect nonlinear DembowskiOstrom multinomials over F p2k where p is any odd prime. We prove that for k odd and p 6= 3 these PN functions define new commutative semifields (in part by studying the nuclei of these semifields). This implies that these functions are CCZ-inequivalent to all previously known PN mappings.
متن کاملCommutative semifields and symplectic spreads ✩
Commutative semifields are constructed by using their relationship with symplectic spreads. The number of pairwise nonisomorphic commutative semifield planes of even order N obtained in this manner is not bounded above by any polynomial in N . The number previously known for any N was less than logN . 2003 Elsevier Inc. All rights reserved. MSC: primary 51A40, 17A35; secondary 05B25, 51A35, 5...
متن کاملPlanar Functions and Commutative Semifields
This paper gives a short survey on planar functions and commutative semifields and considers a possible extension of CCZ-equivalence which is the most general known equivalence relation of functions preserving the planar property. 1. PN and APN functions Let p be any prime number and n any positive integer. A function F from the field Fpn to itself is called planar if all the equations F (x+ a)...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2022
ISSN: ['2330-0000']
DOI: https://doi.org/10.1090/tran/8785